n=int(input())
list1=[]
list2=[]
flag=1
min,max=map(int,input().split())
for i in range(n-1):
x,y=map(int,input().split())
if(x<=min and y>=max):
min=x
max=y
flag=i+2
elif(x<min):
min=x
flag=-1
elif(y>max):
max=y
flag=-1
print(flag)#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n;
cin>>n;
vector <pair <int,int> > v(n);
int mx=INT_MIN;
int mn=INT_MAX;
for(int i=0;i<n;i++)
{
cin>>v[i].first>>v[i].second;
mn=min(v[i].first,mn);
mx=max(v[i].second,mx);
}
int m=0;
for(int i=0;i<n;i++)
{
if(v[i].first==mn&&v[i].second==mx) {
cout<<i+1<<endl;
m++;
break;
}
}
if(m==0) cout<<"-1"<<endl;
}580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |